A maximum principle for combinatorial Yamabe flow
نویسندگان
چکیده
منابع مشابه
A Maximum Principle for Combinatorial Yamabe Flow
In his proof of Andreev’s theorem, Thurston in [1] introduced a conformal geometric structure on two dimensional simplicial complexes which is an analogue of a Riemannian metric. He then used a version of curvature to prove the existence of circle-packings (see also Marden-Rodin [2] for more exposition). Techniques very similar to elliptic partial differential equation techniques were used by Y...
متن کاملA combinatorial Yamabe flow in three dimensions
A combinatorial version of Yamabe flow is presented based on Euclidean triangulations coming from sphere packings. The evolution of curvature is then derived and shown to satisfy a heat equation. The Laplacian in the heat equation is shown to be a geometric analogue of the Laplacian of Riemannian geometry, although the maximum principle need not hold. It is then shown that if the flow is nonsin...
متن کاملA Maximum Principle for Beltrami Color Flow
We study, in this work, the maximum principle for the Beltrami color flow and the stability of the flow’s numerical approximation by finite difference schemes. We discuss, in the continuous case, the theoretical properties of this system and prove the maximum principle in the strong and the weak formulations. In the discrete case, all the second order explicit schemes, that are currently used, ...
متن کاملCombinatorial Continuous Maximum Flow
Maximum flow (and minimum cut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of applications such as image segmentation, stereo, image stitching and texture synthesis. Algorithms based on the classical formulation of maxflow defined on a graph...
متن کاملThe Maximum Principle for Beltrami Color Flow
We study, in this work, the maximum principle for the Beltrami color flow and the stability of the flow’s numerical approximation by finite difference schemes. We discuss, in the continuous case, the theoretical properties of this system and prove the maximum principle in the strong and the weak formulations. In the discrete case, all the second order explicit schemes, that are currently used, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology
سال: 2005
ISSN: 0040-9383
DOI: 10.1016/j.top.2005.02.002